On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves
نویسندگان
چکیده
A long standing conjecture of Richter and Thomassen states that the total number of intersection points between any n simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same point, is at least (1− o(1))n. We confirm the above conjecture in several important cases, including the case (1) when all curves are convex, and (2) when the family of curves can be partitioned into two equal classes such that each curve from the first class is touching every curve from the second class. (Two curves are said to be touching if they have precisely one point in common, at which they do not properly cross.) An important ingredient of our proofs is the following statement: Let S be a family of the graphs of n continuous real functions defined on R, no three of which pass through the same point. If there are nt pairs of touching curves in S, then the number of crossing points is Ω(nt √
منابع مشابه
Beyond the Richter-Thomassen Conjecture
If two closed Jordan curves in the plane have precisely one point in common, then it is called a touching point. All other intersection points are called crossing points. The main result of this paper is a Crossing Lemma for closed curves: In any family of n pairwise intersecting simple closed curves in the plane, no three of which pass through the same point, the number of crossing points exce...
متن کاملA Crossing Lemma for Jordan Curves
If two Jordan curves in the plane have precisely one point in common, and there they do not properly cross, then the common point is called a touching point. The main result of this paper is a Crossing Lemma for simple curves: Let X and T stand for the sets of intersection points and touching points, respectively, in a family of n simple curves in the plane, no three of which pass through the s...
متن کاملArrangements of Pseudocircles: Triangles and Drawings
A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of pseudocircles was initiated by Grünbaum, who defined them as collections of simple closed curves that pairwise intersect in exactly two crossings. Grünbaum conjectured that the number of triangular cells p3 in digon-free arrangements of n pairwise intersecting pseudocircles is at least 2n−4. We p...
متن کاملArcs Intersecting at Most Once
We prove that on a punctured oriented surface with Euler characteristic χ < 0, the maximal cardinality of a set of essential simple arcs that are pairwise nonhomotopic and intersecting at most once is 2|χ|(|χ|+1). This gives a cubic estimate in |χ| for a set of curves pairwise intersecting at most once on a closed surface. We also give polynomial estimates in |χ| for sets of arcs and curves pai...
متن کاملComputing 2-Walks in Polynomial Time
A 2-walk of a graph is a walk visiting every vertex at least once and at most twice. By generalizing decompositions of Tutte and Thomassen, Gao, Richter and Yu proved that every 3-connected planar graph contains a closed 2-walk such that all vertices visited twice are contained in 3separators. This seminal result generalizes Tutte’s theorem that every 4-connected planar graph is Hamiltonian as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 25 شماره
صفحات -
تاریخ انتشار 2015